Fast image search on a VQ compressed image database

Fast image search on a VQ compressed image database

A fast and efficient image search method is developed for a compressed image database using vector quantization (VQ). An image search on an image database requires an exhaustive sequential scan of all the images, given the similarity measure. If compressed images are dealt with, images are decompressed as an initial operation and then the previously mentioned exhaustive search is performed usin...

Fast Image Database Search Using Tree- Structure VQ

In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, there...

Fast Image Database Search using Tree-Structured VQ∗

In this paper, we exploit the techniques of tree structured vector quantization (TSVQ), branch and bound search, and the triangle inequality to speed the search of large image databases. Our method can reduce search computation required to locate images which best match a query image provided by a user. While exact search is possible, a free parameter allows search accuracy to be reduced, there...

Semantic-Based Image Retrial in the VQ Compressed Domain using Image Annotation Statistical Models

Fast VQ codebook search algorithm for grayscale image coding

In this paper, a fast codebook search algorithm that is equivalent to the full search algorithm for image vector quantization is proposed. The image encoding procedure of VQ needs to find the closest codewords in the codebook for image blocks. A great deal of computational cost is consumed in the image encoding procedure. The proposed algorithm employs two test conditions to speedup the image e...